Multiagent auctions for multiple items
نویسندگان
چکیده
Available resources can often be limited with regard to the number of demands. In this paper we propose an approach for solving this problem using the mechanisms of multi-item auctions for allocating the resources to a set of software agents. We consider the resource allocation problem as a market with vendor and buyer agents participating in a multi-item auction. The agents exhibit different acquisition capabilities which let them act differently depending on the current context or situation of the market. We present a model for this approach based on the English auction, and discuss experimental evidence of such a model.
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملA Multiple-Bidding Support Framework for Bidding and Browsing Information
Because of the increasing sophistication of Internet auctions, a user can participate in many different auctions held around the world, each of which offers a wide variety of items. In this paper, we present multiple-bidding support framework based on multiagent system, which can support bidding and browsing information. To extract information on items from real-life Internet auction sites, we ...
متن کاملPrice Updating in Combinatorial Auctions for Coordination of Manufacturing Multiagent Systems
In this work we use the paradigm of multiagent systems to solve the Job Shop problem. Job Shop problem is a particular problem of scheduling in which we try to find an schedule that optimize a objective and is subject to certain constraints. We propose a combinatorial auction mechanism to coordinate agents. The “items” to be sold are the time slots that we divide the time horizon into. In tasks...
متن کاملBOB: Improved winner determination in combinatorial auctions and generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary or substitutable. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper presents a more sophisticated search algorithm for optimal (and anytime) winner determin...
متن کاملSequential auctions for common value objects with budget constrained bidders
This paper analyzes sequential auctions for budget constrained bidders, for multiple heterogeneous common value objects. In most auctions, bidders not only have valuations for objects but also have budget constraints (i.e., constraints on how much they can actually spend in an auction). Given these constraints, the bidders’ problem is to determine how much to bid in each auction. To this end, t...
متن کامل